Non-Monotonic Formalisms and Logic Programming
نویسنده
چکیده
\It seems to me, that work in databases, logic programming, deductive databases, artii-cial intelligence and expert systems will move closer towards one another. Formalisms and techniques developed in each one of those areas will assist the others. Science builds on theories." | J. Minker, 1987
منابع مشابه
Stable Semantics for Disjunctive Programs
[VG89b] A. Van Gelder. Negation as failure using tight derivations for general logic programs. [Prz91c] T. C. Przymusinski. Three-valued non-monotonic formalisms and semantics of logic programs. Journal of Articial Intelligence, 1991. (In print. Extended abstract appeared in: T. C. Przy-musinski. Three-valued non-monotonic formalisms and logic programming. [Ros89b] K. Ross. The well founded sem...
متن کاملThree-Valued Non-Monotonic Formalisms and Semantics of Logic Programs
We introduce 3-valued extensions of major non-monotonic formalisms and we prove that the recently proposed well-founded semantics of logic programs is equivalent, for arbitrary logic programs, to 3-valued forms of McCarthy's circumscription, Reiter's closed world assumption, Moore's autoepistemic logic and Reiter's default theory. This result not only provides a further justiication of the well...
متن کاملAutoepistemic Logic of Knowledge and Beliefs
In recent years, various formalizations of non-monotonic reasoning and diierent semantics for normal and disjunctive logic programs have been proposed, including autoepistemic stationary and static semantics of normal and disjunctive logic programs. In this paper we introduce a simple non-monotonic knowledge representation framework which isomorphically contains all of the above mentioned non-m...
متن کاملAn Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and reenes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-monotonic consequence of a theory if it can be derived monotonically from a theory extended by means of acceptable assumptions. The notion of acceptability for such assumptions is formulated in terms of their ability succ...
متن کاملA Knowledge Representation Framework Based on Autoepistemic Logic of Minimal Beliefs
In recent years, various formalizations of nonmonotonic reasoning and di&rent semantics for normal and disjunctive logic programs have been proposed, including autoepisttic logic, circumscription, CWA, GCWA, ECWA, epi&mic specfications, stable, well-founded, stationary and static semantics of normal and disjunctive logic programs. In this paper we introduce a simple non-monotonic knowledge repr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989